Graph Derangements
نویسندگان
چکیده
We introduce the notion of a graph derangement, which naturally interpolates between perfect matchings and Hamiltonian cycles. We give a necessary and sufficient condition for the existence of graph derangements on a locally finite graph. This result was first proved by W.T. Tutte in 1953 by applying some deeper results on digraphs. We give a new, simple proof which amounts to a reduction to the (Menger-Egerváry-König-)Hall(-Hall) Theorem on transversals of set systems. Finally, we consider the problem of classifying all cycle types of graph derangements on m × n checkerboard graphs. Our presentation does not assume any prior knowledge in graph theory or combinatorics: all definitions and proofs of neeeded theorems are given.
منابع مشابه
Hamilto-connected derangement graphs on S n
We consider the derangements graph in which the vertices are permutations of f1 : : : ng. Two vertices are joined by an edge if the corresponding permutations diier in every position. The derangements graph is known to be hamil-tonian and it follows from a recent result of Jung that every pair of vertices is joined by a Hamilton path. We use this result to settle an open question, by showing th...
متن کاملThe Territorial Raider game and graph derangements
A derangement of a graph G = (V , E) is an injective function f : V → V such that for all v ∈ V , f (v) ≠ v and (v, f (v)) ∈ E. Not all graphs admit a derangement and previous results have characterized graphs with derangements using neighborhood conditions for subsets of V . We establish an alternative criterion for the existence of derangements on a graph. We analyze strict Nash equilibria of...
متن کاملHamilton Connected Derangement Graphs on Sn
We consider the derangements graph in which the vertices are permutations of f ng Two vertices are joined by an edge if the corresponding permuta tions di er in every position The derangements graph is known to be hamil tonian and it follows from a recent result of Jung that every pair of vertices is joined by a Hamilton path We use this result to settle an open question by showing that it is p...
متن کاملHomology of the boolean complex
We construct and analyze an explicit basis for the homology of the boolean complex of a finite simple graph. This provides a combinatorial description of the spheres in the wedge sum representing the homotopy type of the complex. We assign a set of derangements to any finite simple graph. For each derangement, we construct a corresponding element in the homology of the complex, and the collecti...
متن کاملSymptomatic Exudate-Associated Derangements (SEAD), from 3D OCT retinal images of subjects suffering from exudative age-related macular degeneration. In the first stage of a two-stage approach, retinal layers are segmented, candidate SEAD regions
An automated method is reported for segmenting 3D fluid and fluid-associated abnormalities in the retina, so-called Symptomatic Exudate-Associated Derangements (SEAD), from 3D OCT retinal images of subjects suffering from exudative age-related macular degeneration. In the first stage of a two-stage approach, retinal layers are segmented, candidate SEAD regions identified, and the retinal OCT im...
متن کامل